Job Scheduling on Grid Computing Using First Fit, Best Fit, and Worst Fit

نویسندگان

چکیده

Grid computing can be considered large-scale distributed cluster and parallel network processing. The two most important issues in managing user work are resource allocation scheduling of required resources. When jobs submitted, they managed by intermediaries who find allocate the right After stage, scheduled on existing resources according to user's In grid systems with traditional scheduling, submitted placed waiting room queues wait for become available. Each system use a different algorithm execute based other parameters, such as resources, delivery time, execution duration. There is no guarantee that these algorithms will get job done. First Come Serve Left Right Hole Scheduling (FCFS-LRH) reservation strategy improves utilization using local scheduler. Compared strategies. objectives this research. First, compare first fit, best worst fit empty timeslots place them virtual view. Second, reduce idle time value. results showed FCFS-LRH method could value FCFS-EDF FCFS methods. overall better than

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Defining evaluation criteria for Health Information Systems using Human, organization and technology-fit factors (HOT-fit): systematic review

Introduction: The purpose of this study is to conduct a review of a series of published studies on evaluation of health information systems in order to determine the criteria of evaluation of hospital information systems using HOT-fit framework Information sources or data: The present study is a review study to evaluate articles of English databases PubMed, scupos and Persian databases Irandoc...

متن کامل

Comparing First-Fit and Next-Fit for Online Edge Coloring

We study the performance of the algorithms First-Fit and Next-Fit for two online edge coloring problems. In the min-coloring problem, all edges must be colored using as few colors as possible. In the max-coloring problem, a fixed number of colors is given, and as many edges as possible should be colored. Previous analysis using the competitive ratio has not separated the performance of First-Fi...

متن کامل

Tech Report: Best-Harmonically-Fit Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources

AS computer hardware technology advances, both the number and the computational capabilities of processors used in real-time systems are increasing. To take advantages of the increased physical resource’s capacity, multiple groups of real-time applications are deployed on the same physical platform. However, since each group of real-time applications may have different time granularity [1], whe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Khazanah informatika

سال: 2022

ISSN: ['2621-038X', '2477-698X']

DOI: https://doi.org/10.23917/khif.v8i2.17069